People ignore token frequency when deciding how widely to generalize
نویسندگان
چکیده
Many theoretical accounts of generalization suggest that with increasing data, people should tighten their generalizations. However, these accounts presume that the additional data points are all distinct. Other accounts, such as the adaptor grammar framework in linguistics (Johnson, Griffiths, & Goldwater, 2007), suggest that when the additional data points are identical, generalizations about grammaticality need not tighten appreciably: they may be made on the basis of type frequency rather than token frequency (although token frequency can affect other types of learning). We investigated what happens in this situation by presenting participants with identical data in both a linguistic and a non-linguistic context, some ten times as much as others, and asking them to generalize to novel exemplars. We find that people are insensitive to token frequencies when determining how far to generalize, though memory has a small mediating effect: generalizations tighten slightly more when people may rely on a memory aid.
منابع مشابه
Estimating the Parameters for Linking Unstandardized References with the Matrix Comparator
This paper discusses recent research on methods for estimating configuration parameters for the Matrix Comparator used for linking unstandardized or heterogeneously standardized references. The matrix comparator computes the aggregate similarity between the tokens (words) in a pair of references. The two most critical parameters for the matrix comparator for obtaining the best linking results a...
متن کاملToken Sliding on Chordal Graphs
Let I be an independent set of a graph G. Imagine that a token is located on any vertex of I . We can now move the tokens of I along the edges of the graph as long as the set of tokens still defines an independent set of G. Given two independent sets I and J , the TOKEN SLIDING problem consists in deciding whether there exists a sequence of independent sets which transforms I into J so that eve...
متن کاملHomework 6: Universality of Processes
A semaphore is a data structure designed to track how many units of some resource are available. It also provides operations to increase or decrease the number, representing the creation or the consumption of that resource, respectively. A process that wishes to consume one unit of the resource, when none are available, will be blocked until one new unit of the resource is created. Semaphores a...
متن کاملHomework 6: Universality of Processes
A semaphore is a data structure designed to track how many units of some resource are available. It also provides operations to increase or decrease the number, representing the creation or the consumption of that resource, respectively. A process that wishes to consume one unit of the resource, when none are available, will be blocked until one new unit of the resource is created. Semaphores a...
متن کاملAn Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کامل